Neighbor selection for proportional fairness in P2P networks
نویسندگان
چکیده
This paper analyzes reciprocation strategies in peer-to-peer networks from the point of view of the resulting resource allocation. Our stated aim is to achieve through decentralized interactions a weighted proportionally fair allocation. We analyze the desirable properties of such allocation, as well as an ideal proportional reciprocity algorithm to achieve it, using tools of convex optimization. We then seek suitable approximations to the ideal allocation which impose practical constraints on the problem: numbers of open connections per peer, with transport layer-induced bandwidth sharing, and the need of random exploration of the peer-to-peer swarm. Our solution in terms of a Gibbs sampler dynamics characterized by a suitable energy function is implemented in simulation, comparing favorably with a number of alternatives.
منابع مشابه
From resource allocation to neighbor selection in peer-to-peer networks
In peer-to-peer networks there are two main issues: the efficiency in the use of the upload bandwidth of the peers; and the incentives that the resource allocation provides to the peers, which should promote the upload of content which is key to its scalability. There are some ad-hoc solutions to these issues such as the popular BitTorrent protocol. In this thesis we pretend to study, first fro...
متن کاملA Fuzzy Algorithm of Peer Selection for P2P Streaming Media System Based on Gossip Transmission Protocol
The traditional Gossip protocol selects the neighbor nodes randomly. It does not consider the factors, such as the capacities of network transmission and node storage, which affect the network performance. It further causes the drawback of successful search ratio relatively lower, and also network transmission payloads have the characteristics of randomness. In this paper, to overcome those dra...
متن کاملNeighbor-Selection Strategy in Peer-to-Peer Networks
A new generation of peer-to-peer (P2P) applications are being increasingly used for downloading large-volume contents such as movies and software. In these P2P applications, a central “tracker” decides about which peer becomes a neighbor to which other peers, and this decision critically dictates the distribution efficiency. Our paper proposes a new neighbor-selection strategy applicable to the...
متن کاملA Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory
The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...
متن کاملOn neighbor-selection strategy in hybrid peer-to-peer networks
Recently, computer users have increased their interests in downloading large-volume contents like movies and software from the Internet, and a new generation of peer-to-peer (P2P) file-swapping applications that aims at improving the efficiency of transfer are gaining popularity. In these P2P applications, a central “tracker” decides about which peer becomes a neighbor to which other peers. Thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Networks
دوره 83 شماره
صفحات -
تاریخ انتشار 2015